Gentzen-Prawitz Natural Deduction as a Teaching Tool
نویسندگان
چکیده
We report a four-years experiment in teaching reasoning to undergraduate students, ranging from weak to gifted, using GentzenPrawitz’s style natural deduction. We argue that this pedagogical approach is a good alternative to the use of Boolean algebra for teaching reasoning, especially for computer scientists and formal methods practioners.
منابع مشابه
Natural Deduction for Full S5 Modal Logic with Weak Normalization
Natural deduction systems for classical, intuitionistic and modal logics were deeply investigated by Prawitz [10] from a proof-theoretical perspective. Prawitz proved weak normalization for classical logic just for a language without ∨, ∃ and with a restricted application of reduction ad absurdum. Reduction steps related to ∨, ∃ and classical negation brings about a lot of problems solved only ...
متن کاملFull classical S5 in natural deduction with weak normalization
Natural deduction systems for classical, intuitionistic and modal logics were deeply investigated by Prawitz [D. Prawitz, Natural Deduction: A Proof-theoretical Study, in: Stockholm Studies in Philosophy, vol. 3, Almqvist and Wiksell, Stockholm, 1965. Reprinted at: Dover Publications, Dover Books on Mathematics, 2006] from a proof-theoretical perspective. Prawitz proved weak normalization for c...
متن کاملGeneralised elimination rules and harmony
Standard natural deduction rules for Int (intuitionistic predicate logic) in the style of Gentzen and Prawitz are presumed to be familiar. The theory of cut-elimination for sequent calculus rules is very clear; whether a derivation in a sequent calculus is cut-free or not is easily defined, according to the presence or absence of instances of the Cut rule. Normality of a (natural) deduction is ...
متن کاملA new proof of normalization for NS4
In 1965 Dag Prawitz presented an extension of Gentzen-type systems of Natural Deduction to modal concepts of S4. Maria da Paz Medeiros showed in 2006 that the proof of normalisation for classical S4 does not hold and proposed a new proof of normalisation for a logically equivalent system, the system NS4. However two problems in the proof of the critical lemma used by Medeiros in her proof were ...
متن کاملNatural deduction via graphs: formal definition and computation rules
We introduce the formalism of deduction graphs as a generalization of both Gentzen-Prawitz style natural deduction and Fitch style flag deduction. The advantage of this formalism is that subproofs can be shared, like in flag deductions (and unlike natural deduction), but also that the linearisation used in flag deductions is avoided. Our deduction graphs have both nodes and boxes, which are col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0907.3599 شماره
صفحات -
تاریخ انتشار 2009